Learning regular omega languages
نویسندگان
چکیده
منابع مشابه
Learning Regular Omega Languages
We provide an algorithm for learning an unknown regular set of infinite words, using membership and equivalence queries. Three variations of the algorithm learn three different canonical representations of omega regular languages, using the notion of families of dfas. One is of size similar to L$, a dfa representation recently learned using L ∗ [7]. The second is based on the syntactic forc, in...
متن کاملMonitorability of omega-regular languages
Arguably, ω-regular languages play an important rôle as a specification formalism in many approaches to systems monitoring via runtime verification. However, since their elements are infinite words, not every ω-regular language can sensibly be monitored at runtime when only a finite prefix of a word, modelling the observed system behaviour so far, is available. The monitorability of an ω-regula...
متن کاملWeak $\omega$-Regular Trace Languages
Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are “linearizations” of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the latter. In this vein, our contribution is twofold. Firstly, we develop definitions that allow classification of ω-regular trace languages in terms of the correspo...
متن کاملThe Bridge Between Regular Cost Functions and Omega-Regular Languages
In this paper, we exhibit a one-to-one correspondence between ω-regular languages and a subclass of regular cost functions over finite words, called ω-regular like cost functions. This bridge between the two models allows one to readily import classical results such as the last appearance record or the McNaughton-Safra constructions to the realm of regular cost functions. In combination with ga...
متن کاملBeyond $\omega$BS-regular Languages: $\omega$T-regular Expressions and Counter-Check Automata
In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular languages (the combination of ωBand ωS-regular ones). While the first two classes satisfy a generalized closure property, namely, the complemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.07.031